Hard uncertainties in multiobjective layout optimization of photovoltaic power plants

This paper describes how to treat hard uncertainties defined by so-called uncertainty maps in multiobjective optimization problems. For the uncertainty map being set-valued, a Taylor formula is shown under appropriate assumptions. The hard uncertainties are modeled using parametric set optimization problems for which a scalarization result is given. The presented new approach for the solution of multiobjective optimization problems with hard uncertainties is then applied to the layout optimization of photovoltaic power plants. Since good weather forecasts are difficult to obtain for future years, weather data are really hard uncertainties arising in the planning process. Numerical results are presented for a real-world problem on the Galapagos island Isabela.     

Approximate solutions and scalarization in set-valued optimization

Abstract

Certain notions of approximate weak efficient solutions are considered for a set-valued optimization problem based on vector and set criteria approaches. For approximate solutions based on the vector approach, a characterization is provided in terms of an extended Gerstewitz’s function. For the set approach case, two notions of approximate weak efficient solutions are introduced using a lower and an upper quasi order relations for sets and further compactness and stability aspects are discussed for these approximate solutions. Existence and scalarization using a generalized Gerstewitz’s function are also established for approximate solutions, based on the lower set order relation.     

Two optimization problems in linear regression with interval data

We consider a linear regression model where neither regressors nor the dependent variable is observable; only intervals are available which are assumed to cover the unobservable data points. Our task is to compute tight bounds for the residual errors of minimum-norm estimators of regression parameters with various norms (corresponding to least absolute deviations (LAD), ordinary least squares (OLS), generalized least squares (GLS) and Chebyshev approximation). The computation of the error bounds can be formulated as a pair of max–min and min–min box-constrained optimization problems. We give a detailed complexity-theoretic analysis of them. First, we prove that they are NP-hard in general. Then, further analysis explains the sources of NP-hardness. We investigate three restrictions when the problem is solvable in polynomial time: the case when the parameter space is known apriori to be restricted into a particular orthant, the case when the regression model has a fixed number of regression parameters, and the case when only the dependent variable is observed with errors. We propose a method, called orthant decomposition of the parameter space, which is the main tool for obtaining polynomial-time computability results.     

Quantitative asymptotic regularity results for the composition of two mappings

In this paper, we use techniques which originate from proof mining to give rates of asymptotic regularity and metastability for a sequence associated to the composition of two firmly nonexpansive mappings.     

分布式通信响应优化问题及其内点法求解

为了优化移动互联网的分布式通信系统的响应速度,建立分布式通信系统响应速度最优化问题的数学模型,并设计和改进求解该最优化问题的内点法.针对该最优化问题发展一套高效率预条件方法来帮助求解内点法,不但改善计算方法的数值稳定性,而且提高算法的计算效率.通过数值实验验证该预条件对算法稳定性和效率的提高.     

自适应多种群回溯群居蜘蛛算法求解TSP问题

在群居蜘蛛优化算法中引入自适应决策半径,将蜘蛛种群动态地分成多个种群,种群内适应度不同的个体采取不同的更新方式.在筛选全局极值的基础上,根据进化程度执行回溯迭代更新,提出一种自适应多种群回溯群居蜘蛛优化算法,旨在提高种群样本多样性和算法全局寻优能力.函数寻优结果表明改进算法具有较快的收敛速度和较高的收敛精度.最后将其应用于TSP问题的求解.     

基于改进的PSO-SVM的音频信号特征识别和分类

针对音频信号准确性分类的问题,提出一种基于改进的的粒子群优化算法(PSO)的支持向量机(SVM)音频信号分类的方法,简称IPSO-SVM.首先用Mel倒谱系数法对4种音频信号进行特征提取.其次在PSO中引入自适应变异因子,能够成功地跳出局部极小值点;然后对PSO中的惯性权重进行了改进,将惯性权重由常数变为指数型递减函数.随着迭代的进行,使权重逐渐减小,这样做有利于粒子进行局部寻优.最后用改进的PSO不断优化SVM中的惩罚因子c和核函数参数g来提高预测精度.实验结果表明,与传统的SVM、PSO-SVM、GA-SVM相比,我们提出的IPSO-SVM算法分类结果更精确.     

基于动态自适应t分布变异的人群搜索算法

针对人群搜索算法在进化后期大量个体聚集局部最优时,易陷入局部最优,搜索精度低的缺陷,提出一种基于t分布变异的人群搜索算法.算法使用动态自适应方式确定变异步长,引入t分布变异算子以融合柯西变异和高斯变异的优点,促进算法在进化早期具备良好的全局探索能力,在进化后期收获较强的局部开发能力,增加种群的多样性;采用边界缓冲墙策略处理越界问题,避免越界个体聚集在边界值上的缺陷.实验结果表明,算法比基本人群搜索算法具有更高的寻优精度和收敛速度,是一种有效的算法.     

矩阵优化扰动性分析的若干进展

由于近年来实际问题特别是大数据应用的发展,矩阵优化问题越来越得到优化研究者,甚至是其他领域的研究者的高度关注,成为热点问题.优化问题的扰动性分析是优化理论研究的基础与核心,为包括算法设计在内的优化研究提供重要的理论基础.由于矩阵优化问题的非多面体性,使得相应扰动分析理论的研究本质上与经典的多面体优化问题(非线性规划)不同.结合文献[1,2],简要介绍矩阵优化扰动性分析方面取得的若干最新进展.